Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle
نویسندگان
چکیده
Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle passing through specified vertices with prescribed distances between them in large graphs.
منابع مشابه
On 3-regular 4-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian cycle) in G containing these k vertices in the specified order. In 1997 Ng and Schultz introduced these concepts of cycle orderability and posed the question of the existence of 3-regular 4-ordered (hamiltonian) graph...
متن کامل4-ordered-Hamiltonian problems of the generalized Petersen graph GP(n, 4)
AgraphG is k-ordered if for every sequence of k distinct vertices ofG, there exists a cycle inG containing these k vertices in the specified order. It is k-ordered-Hamiltonian if, in addition, the required cycle is a Hamiltonian cycle in G. The question of the existence of an infinite class of 3-regular 4-ordered-Hamiltonian graphs was posed in Ng and Schultz in 1997 [2]. At the time, the only ...
متن کاملHeavy cycles passing through some specified vertices in weighted graphs
A weighted graph is one in which every edge e is assigned a nonnegative number, called the weight of e. The sum of the weights of the edges incident with a vertex v is called the weighted degree of v. The weight of a cycle is defined as the sum of the weights of its edges. In this paper, we prove that: (1) if G is a 2-connected weighted graph such that the minimum weighted degree of G is at lea...
متن کاملPairs of forbidden class of subgraphs concerning K1, 3 and P6 to have a cycle containing specified vertices
In [3], Faudree and Gould showed that if a 2-connected graph contains no K1,3 and P6 as an induced subgraph, then the graph is hamiltonian. In this paper, we consider the extension of this result to cycles passing through specified vertices. We define the families of graphs which are extension of the forbidden pair K1,3 and P6, and prove that the forbidden families implies the existence of cycl...
متن کاملSolution to an open problem on 4-ordered Hamiltonian graphs
A graphG is k-ordered if for any sequence of k distinct vertices ofG, there exists a cycle in G containing these k vertices in the specified order. It is k-ordered Hamiltonian if, in addition, the required cycle is Hamiltonian. The question of the existence of an infinite class of 3-regular 4-ordered Hamiltonian graphs was posed in 1997 [10]. At the time, the only known examples were K4 and K3,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 33 شماره
صفحات -
تاریخ انتشار 2017